Art gallery problem - PDFSEARCH.IO - Document Search Engine

Art gallery problem
Results: 63

#	Item
11	POLYGON PARTITIONSINTRODUCTION In 1973, Victor Klee posed the problem of determining the minimum number of guards sufficient to cover the interior of an n-wall art gallery room (HonsbergerHe posed this que Add to Reading List Source URL: cs.smith.edu Language: English - Date: 2008-12-17 15:01:07
12	POLYGON PARTITIONSINTRODUCTION In 1973, Victor Klee posed the problem of determining the minimum number of guards sufficient to cover the interior of an n-wall art gallery room (HonsbergerHe posed this que Add to Reading List Source URL: www.cs.smith.edu Language: English - Date: 2008-12-17 15:01:07
13	EXTERIOR VISIBILITYINTRODUCTION Derick Wood and Joseph Malkelvitch independently posed two interesting variants of the original Art Gallery Problem, which Wood dubbed The Fortress Problem and The Prison Yard Probl Add to Reading List Source URL: www.cs.smith.edu Language: English - Date: 2008-12-17 15:05:26
14	Face-Guarding Polyhedra Giovanni Viglietta∗ April 18, 2014 Abstract We study the Art Gallery Problem for face guards in polyhedral Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2014-04-18 18:05:40
15	Simple Rectilinear Polygons are Perfect under Rectangular Vision Esther Arkin∗† Michael Biro‡† Omrit Filtser§ Matthew J. Katz§† Joseph S.B. Mitchell Abstract The Art Gallery problem (see O’Rourke [3] for an Add to Reading List Source URL: www-cs.engr.ccny.cuny.edu Language: English - Date: 2013-10-17 18:48:22 Polygons Geometry Mathematics Rectilinear polygon Visibility polygon Polygon Art gallery problem Rotating calipers Polygon covering
16	Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2009-09-24 16:12:25 Computational geometry Analysis of algorithms Ε-net Time complexity Art gallery problem Algorithm Randomized algorithm Sensor SL Theoretical computer science Computational complexity theory Applied mathematics
17	CCCG 2011, Toronto ON, August 10–12, 2011 Edge-guarding Orthogonal Polyhedra Nadia M. Benbernou∗ Erik D. Demaine† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Space-filling polyhedra Zonohedra Polyhedra Polyhedron Art gallery problem Icosahedron Octahedron Vertex Cuboid Geometry Platonic solids Deltahedra
18	CCCG 2011, Toronto ON, August 10–12, 2011 Open Guard Edges and Edge Guards in Simple Polygons Csaba D. T´ oth∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Vertex Art gallery problem Pseudotriangle Quadrilateral Polyhedron Star-shaped polygon Geodesic Star polygon Regular polygon Geometry Polygons Simple polygon
19	The Visibility Region of Points in a Simple Polygon Otfried Cheong Ren´e van Oostrum Hong Kong University of Science and Technology Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:02:14 Polytopes Art gallery problem Computational geometry Simple polygon Polyhedra Complex polytope Path decomposition Geometry Mathematics Polygons
20	CCCG 2010, Winnipeg MB, August 9–11, 2010 Visibility Maintenance of a Moving Segment Observer inside Polygons with Holes Hoda Akbari∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:16 Vertex Visibility graph Visibility polygon Art gallery problem Straight skeleton Geometry Polygons Simple polygon